Performance Ananlysis of Speeded-Up High-Speed Packet Switches
نویسندگان
چکیده
In this paper, we study the performance of high-speed packet switches, where the switch fabric operates at a slightly higher speed than the links, i.e., a speeded-up switch. As link speeds keep increasing, the speedup of N (number of links) needed for pure output queueing (which is the best) becomes a significant technical challenge. This is one of the main reasons for the renewed interest in moderately speeded-up switch fabrics. The aim of this paper is to highlight the result that only a moderate speed-up factor (less than two) is sufficient to achieve full input link utilization. In particular, we emphasize that this holds, even without relying on a central switch controller making intelligent decisions on which packets to schedule through the switch. As shown in recent works, i.e., [10, 12, 8, 2, 11], there are clearly benefits to using intelligent controllers, but they do come at a cost. Instead, in this paper we focus on what can be achieved by relying simply on switch speedup. We do so by means of analysis and simulations for average queue length in switches with speedup. We also present simulation results on delay performance.
منابع مشابه
Performance analysis of speeded - up high - speed packet switches 1
In this paper, we study the performance of high-speed packet switches, where the switch fabric operates at a slightly higher speed than the links, i.e., a speeded-up switch. Such structures are by no means new and there are two well studied architectures in the literature for such packet switches: pure input queueing (no speedup) and pure output queueing (speedup of N , the number of links), wi...
متن کاملPerformance Analysis of Speeded-Up High-Speed Packet Switches
In this paper, we study the performance of high-speed packet switches, where the switch fabric operates at a slightly higher speed than the links, i.e., a speeded-up switch. Such structures are by no means new and there are two well studied architectures in the literature for such packet switches: pure input queueing (no speedup) and pure output queueing (speedup of N , the number of links), wi...
متن کاملA Novel Transistor Level Implementation of a High Speed Packet Switch
High speed packet switches are inevitable for ultra high data rate networking systems. The throughput of these switches has to be ideally 100% for effective utilization of the network. While Output Queued (OQ) switches have the optimal delay-throughput performance for all traffic distributions, they require N-times speed up in the fabric that limits the scalability of this architecture. An Inpu...
متن کاملHigh Speed Networks EFFICIENT SCHEDULING OF VARIABLE-LENGTH IP PACKETS ON HIGH-SPEED SWITCHES*
ATM switches have been proposed as the switching fabric cores of many high-performance IP switches. In this paper, we present an efficient algorithm called IPPIM for scheduling variable-length IP packets on these switches and compare its performance with the original parallel iterative matching (PIM) ATM cell scheduling algorithm. The mean IP packet delays using both the PIM and the IP-PIM sche...
متن کاملIntegration of Unicast and Multicast Scheduling in Input-Queued Packet Switches with High Scalability
This paper focuses on the scalability problems for high-speed switches, and presents an integrated scheduling algorithm that supports unicast and multicast traffic efficiently in input-queued packet switches. Considering the tradeoff balancing complexity and performance, the proposed integrated algorithm performs without iteration, and reduces the scheduling overhead to O(N) with a two-phase (r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. High Speed Networks
دوره 10 شماره
صفحات -
تاریخ انتشار 1999